#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=2e5+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn];
int main(void){
   	cin.tie(0);std::ios::sync_with_stdio(false);
    LL t;cin>>t;
    while(t--){
        multiset<LL>s;
        LL n,k;cin>>n>>k;
        if(n==1){
            cout<<"Yes"<<endl;
            continue;
        }
        for(LL i=1;i<=n;i++){
            cin>>a[i];
            s.insert(a[i]);
        }
        LL cnt=1;
        LL tail=a[1];
        for(LL i=2;i<=n;i++){
            auto it=s.lower_bound(tail+1);
            if(it==s.end()){
                cnt++;
                tail=a[i];
            }
            else if( (*it)!=a[i]){
                cnt++;
                tail=a[i];
            }
            else{
                tail=a[i];
            }
        }
        if(cnt<=k){
            cout<<"Yes"<<endl;
        }
        else{
            cout<<"No"<<endl;
        }
    }
   	return 0;
}
